Tensorial Polar Decomposition of 2D fourth-order tensors
نویسندگان
چکیده
منابع مشابه
Decomposition and Visualization of Fourth-Order Elastic-Plastic Tensors
Visualization of fourth-order tensors from solid mechanics has not been explored in depth previously. Challenges include the large number of components (3x3x3x3 for 3D), loss of major symmetry and loss of positive definiteness (with possibly zero or negative eigenvalues). This paper presents a decomposition of fourth-order tensors that facilitates their visualization and understanding. Fourth-o...
متن کاملFourth-order Tensors with Multidimensional Discrete Transforms
The big data era is swamping areas including data analysis, machine/deep learning, signal processing, statistics, scientific computing, and cloud computing. The multidimensional feature and huge volume of big data put urgent requirements to the development of multilinear modeling tools and efficient algorithms. In this paper, we build a novel multilinear tensor space that supports useful algori...
متن کاملGlyphs for Asymmetric Second-Order 2D Tensors
Tensors model a wide range of physical phenomena. While symmetric tensors are sufficient for some applications (such as diffusion), asymmetric tensors are required, for example, to describe differential properties of fluid flow. Glyphs permit inspecting individual tensor values, but existing tensor glyphs are fully defined only for symmetric tensors. We propose a glyph to visualize asymmetric s...
متن کاملFeature selection from high-order tensorial data via sparse decomposition
4 Principal component analysis (PCA) suffers from the fact that each principal component (PC) is a linear combination 5 of all the original variables, thus it is difficult to interpret the results. For this reason, sparse PCA (sPCA), which 6 produces modified PCs with sparse loadings, arises to clear away this interpretation puzzlement. However, as a result 7 of that sPCA is limited in handling...
متن کاملComputing the polyadic decomposition of nonnegative third order tensors
Computing the minimal polyadic decomposition (also often referred to as canonical decomposition, or sometimes Parafac) amounts to finding the global minimum of a coercive polynomial in many variables. In the case of arrays with nonnegative entries, the low-rank approximation problem is well posed. In addition, due to the large dimension of the problem, the decomposition can be rather efficientl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Mécanique
سال: 2015
ISSN: 1631-0721
DOI: 10.1016/j.crme.2015.07.002